Geometric and o-minimal Littlewood–Offord problems
نویسندگان
چکیده
The classical Erdős–Littlewood–Offord theorem says that for nonzero vectors a1,…,an∈Rd, any x∈Rd, and uniformly random (ξ1,…,ξn)∈{−1,1}n, we have Pr(a1ξ1+⋯+anξn=x)=O(n−1/2). In this paper, show Pr(a1ξ1+⋯+anξn∈S)≤n−1/2+o(1) whenever S is definable with respect to an o-minimal structure (e.g., holds when algebraic hypersurface), under the necessary condition it does not contain a line segment. We also obtain inverse in setting.
منابع مشابه
Geometric Categories and O - Minimal Structures
The theory of subanalytic sets is an excellent tool in various analytic-geometric contexts; see, for example, Bierstone and Milman [1]. Regrettably, certain “nice” sets—like { (x, x) : x > 0 } for positive irrational r, and { (x, e−1/x) : x > 0 }—are not subanalytic (at the origin) in R. Here we make available an extension of the category of subanalytic sets that has these sets among its object...
متن کاملReachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of having only constant reset upon discrete jumps is a strong limitation for their applicability: hence, an important issue for both theoreticians and practitioners, is that of relaxing the above constraint, while not fal...
متن کاملO-minimal residue fields of o-minimal fields
Let R be an o-minimal field with a proper convex subring V . We axiomatize the class of all structures (R, V ) such that kind, the corresponding residue field with structure induced from R via the residue map, is o-minimal. More precisely, in [8] it was shown that certain first order conditions on (R, V ) are sufficient for the o-minimality of kind. Here we prove that these conditions are also ...
متن کاملEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these problems can be solved in incremental polynomial time, while the second problem is NP-hard: given a collection of minimal dicuts for G, it is NP-complete to tell whether it can be extended. The latter result implies, in par...
متن کاملRandomizing O-minimal Theories
The randomization of a complete first order theory T is the complete continuous theory T R with two sorts, a sort for random elements of models of T , and a sort for events in an underlying atomless probability space. We show that if T has the exchange property and acl = dcl, then T R has a strict independence relation in the home sort, and hence is real rosy. In particular, if T is o-minimal, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Probability
سال: 2023
ISSN: ['0091-1798', '2168-894X']
DOI: https://doi.org/10.1214/22-aop1590